An Improved Fast and Secure Hash Algorithm
نویسندگان
چکیده
Recently, a fast and secure hash function SFHA – 256 has been proposed and claimed as more secure and as having a better performance than the SHA – 256. In this paper an improved version of SFHA – 256 is proposed and analyzed using two parameters, namely the avalanche effect and uniform deviation. The experimental results and further analysis ensures the performance of the newly proposed and improved SFHA-256. From the analysis it can be concluded that the newly proposed algorithm is more secure, efficient, and practical. Keywords—SHA-256, SFHA-256, Improved SFHA-256
منابع مشابه
An Improved Hash Function Based on the Tillich-Zémor Hash Function
Using the idea behind the Tillich-Zémor hash function, we propose a new hash function. Our hash function is parallelizable and its collision resistance is implied by a hardness assumption on a mathematical problem. Also, it is secure against the known attacks. It is the most secure variant of the Tillich-Zémor hash function until now.
متن کاملA Chaining Authentication Scheme Using S/Key OTP Based on a Fast and Secure Hash Algorithm in Wireless Sensor Networks
Security is another important aspect and its development has enhanced widespread adoption of WSNs. In a typical situation, user wants to access the data directly from a node instead of accessing at the gateway or at the backend of an application system. Therefore, it is necessary that such an access is allowed only to a registered user. Recently, 3-way chaining authentication scheme which uses ...
متن کاملA Fast Portable Implementation of the Secure Hash Algorithm
In 1992, NIST announced a proposed standard for a collision-free hash function. The algorithm for producing the hash value is known as the Secure Hash Algorithm (SHA), and the standard using the algorithm in known as the Secure Hash Standard (SHS). Later, an announcement was made that a scientist at NSA had discovered a weakness in the original algorithm. A revision to this standard was then an...
متن کاملA Fast Portable Implementation of the Secure Hash Algorithm , III ∗ †
In 1992, NIST announced a proposed standard for a collision-free hash function. The algorithm for producing the hash value is known as the Secure Hash Algorithm (SHA), and the standard using the algorithm in known as the Secure Hash Standard (SHS). Later, an announcement was made that a scientist at NSA had discovered a weakness in the original algorithm. A revision to this standard was then an...
متن کاملMDx-MAC and Building Fast MACs from Hash Functions
We consider the security of message authentication code (MAC) algorithms, and the construction of MACs from fast hash functions. A new forgery attack applicable to all iterated MAC algorithms is described, the first known such attack requiring fewer operations than exhaustive key search. Existing methods for constructing MACs from hash functions, including the secret prefix, secret suffix, and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JIPS
دوره 8 شماره
صفحات -
تاریخ انتشار 2012